Triangle Strip Compression

نویسنده

  • Martin Isenburg
چکیده

In this paper we introduce a simple and efficient scheme for encoding the connectivity and the stripification of a triangle mesh. Since generating a good set of triangle strips is a hard problem, it is desirable to do this just once and store the computed strips with the triangle mesh. However, no previously reported mesh encoding scheme is designed to include triangle strip information into the compressed representation. Our algorithm encodes the stripification and the connectivity in an interwoven fashion, that exploits the correlation existing between the two.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving Rendering by Texture Map-Based Triangle Strips

Improving the rendering performance is a basic problem for computer graphics system. In this paper, we are aiming to investigate the impact on the rendering performance of some geometry compression methods. These compression methods are devised to optimize the use of the vertex cache. We will study how it interacts with the on-chip texture cache. Based on the study, one simple method of improvi...

متن کامل

Improving Rendering Performance by Texture-Map-Based Triangle Strips

Improving the rendering performance is a basic problem for computer graphics system. In this paper, we are aiming to investigate the impact on the rendering performance of some geometry compression methods. These methods are devised to optimize the use of the vertex cache. We will study how they interact with the on-chip texture cache. Based on the study, one simple method of improving renderin...

متن کامل

Triangle Mesh Compression for Fast Rendering

Modern GIS(Geographic Information System) application programs and simulation systems have to handle large datasets for rendering. Currently three dimensional rendering hardware are facing a memory bus bandwidth bottleneck problem at the graphics pipeline. One general solution for this problem is to compress the static three dimensional geometry in a preprocessing phase. We present a new mesh c...

متن کامل

Data-Parallel Decompression of Triangle Mesh Topology

We propose a lossless, single-rate triangle mesh topology codec tailored for fast data-parallel GPU decompression. Our compression scheme coherently orders generalized triangle strips in memory. To unpack generalized triangle strips efficiently, we propose a novel parallel and scalable algorithm. We order vertices coherently to further improve our compression scheme. We use a variable bit-lengt...

متن کامل

Contour-based Progressive Transmission of Cutting Plane Data

We present an efficient algorithm for progressive transmission of cutting plane data extracted from large scale Computational Field Simulation (CFS) datasets. Since cutting planes are the most frequently-used method for examination of 3D simulation results, efficient compression of both the geometry/topography and the associated field data is important for good visualization performance, especi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2000